Accurate 3D Mesh Simplification
نویسنده
چکیده
v
منابع مشابه
A comparison of mesh simplification algorithms
In many applications the need for an accurate simplification of surface meshes is becoming more and more urgent. This need is not only due to rendering speed reasons, but also to allow fast transmission of 3D models in network-based applications. Many different approaches and algorithms for mesh simplification have been proposed in the last few years. We present a survey and a characterization ...
متن کامل3d Face Correspondence Based on Uniform Mesh Resampling Combined with Mesh Simplification
This present study, proposes a new 3D face correspondence method. A uniform mesh re-sampling algorithm is combined with mesh simplification algorithm to make correspondence between vertices of prototypical 3D faces. Uniform mesh re-sampling algorithm is developed to obtain the same topology between 3D faces with different structures. A global error metrics is proposed and mesh simplification is...
متن کاملSurface Simplification Based on a Statistical Approach
-This paper presents work in progress and continues a project devoted to developing shape modeling system for surface generation and enhancement. A local mesh enhancement based on statistical characteristics of an initial triangle mesh is proposed for mesh simplification. Experimental results are included to demonstrate the functionality of our simplification algorithm. Key-Words: Mesh statisti...
متن کاملA Frequency-Domain Approach to Watermarking 3D Shapes
This paper presents a robust watermarking algorithm with informed detection for 3D polygonal meshes. The algorithm is based on our previous algorithm [22] that employs mesh-spectral analysis to modify mesh shapes in their transformed domain. This paper presents extensions to our previous algorithm so that (1) much larger meshes can be watermarked within a reasonable time, and that (2) the water...
متن کاملA General Algorithm for Triangular Meshes Simplification
This article introduces the algorithm for simplification of 2D and 3D triangular meshes. The algorithm evaluates and removes vertices. A hash table is used to speed up the process of selecting the appropriate vertex for its removal. Therefore, this part of the algorithm is executed in constant time O(1). In spite of simplification, triangular mesh models still keep majority of their own essenti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013